Combinatorics of rational singularities

A normal surface singularity is rational if and only if the dual intersection graph of a desingularization satisfies some combinatorial properties. In fact, the graphs defined in this way are trees. In this paper we give geometric features of these trees. In particular, we prove that the number of vertices of valency ≥ 3 in the dual intersection tree of the minimal desingularization of a rational singularity of multiplicity m ≥ 3 is at most m− 2. Mathematics Subject Classification (2000). 32S25, 32S45, 15Q10, 05C05.